A FIRST-ORDER FRAMEWORK FOR INQUISITIVE MODAL LOGIC

نویسندگان

چکیده

Abstract We present a natural standard translation of inquisitive modal logic $\mathrm{InqML}$ into first-order over the two-sorted relational representations intended models, which captures built-in higher-order features . This is based on graded notion flatness that ties inherent second-order, team-semantic information states to subsets or tuples bounded size. A pseudo-models, relaxes non-elementary constraints gives rise an elementary, purely model-theoretic proof compactness property for Moreover, we prove Hennessy-Milner theorem , crucially uses $\omega $ -saturated pseudo-models and new translation. As corollaries also obtain van Benthem style characterisation theorems.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

First-Order Inquisitive Pair Logic

We introduce two different calculi for a first-order extension of inquisitive pair semantics (Groenendijk 2008): Hilbert-style calculus and Tree-sequent calculus. These are first-order generalizations of (Mascarenhas 2009) and (Sano 2009), respectively. First, we show the strong completeness of our Hilbert-style calculus via canonical models. Second, we establish the completeness and soundness ...

متن کامل

Bisimulation in Inquisitive Modal Logic

Inquisitive modal logic, INQML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they are interested in. Technically, INQML fits within the family of logics based on team semantics. From a model-theoretic perspective, it takes us a step in ...

متن کامل

An Ehrenfeucht-fraïssé Game for Inquisitive First-order Logic

Inquisitive first-order logic, InqBQ, extends classical first-order logic with questions. From a technical perspective, InqBQ allows us to talk about a plurality of first-order structures, expressing not only facts about each structure in isolation, but also about how these structures relate to each other. We describe an Ehrenfeucht-Fräıssé game for InqBQ and show that this characterizes the ex...

متن کامل

First-Order Classical Modal Logic

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness...

متن کامل

Lecture Notes on First-Order Reductions of First-Order Modal Logic 15-816: Modal Logic

First-order modal logic is clearly more than classical first-order logic, because modalities can be used to phrase more advanced necessity and possibility properties. At the same time, first-order modal logic and non-modal first-order logic are not entirely different either. Modalities quantify over all ( ) or some (♦) worlds. Quantifiers also quantify over all (∀) or some (∃) objects (yet not ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Review of Symbolic Logic

سال: 2021

ISSN: ['1755-0211', '1755-0203']

DOI: https://doi.org/10.1017/s175502032100037x